An Efficient Distributed Tuple Space Implementation for Networks of Workstations

نویسندگان

  • Antony I. T. Rowstron
  • Alan Wood
چکیده

In this paper an overview of a novel run time system for the management of tuple spaces, which utilises implicit information about tuple space use in Linda programs to maximise its performance. The approach is novel compared to other tuple space implementations because they either ignore the information, or expect the programmer to provide the information explicitly. A number of experimental results are given to demonstrate the advantages of using the our approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Eecient Distributed Tuple Space Implementation for Networks of Heterogenous Workstations

The distributed tuple space concept, on which the Linda process coordination model is founded, has given rise to several implementations on parallel machines and networks of heterogenous workstations. However, the fundamental techniques used in there systems have remained largely unchanged from the original Linda implementations. This paper describes a novel implementation which, using extensio...

متن کامل

An e cient distributed tuple space implementation for networks of heterogenous workstations

The distributed tuple space concept, on which the Linda process coordination model is founded, has given rise to several implementations on parallel machines and networks of heterogenous workstations. However, the fundamental techniques used in there systems have remained largely unchanged from the original Linda implementations. This paper describes a novel implementation which, using extensio...

متن کامل

Design , Implementation and Performance of aMutex - Token based Fault - Tolerant Tuple

LiPS 1 is a system for distributed computing using idle-cycles in networks of workstations. In its version 2.3, it is currently used at the Universitt at des Saar-landes in Saarbr ucken, Germany to perform computationally intensive applications in the eld of cryptography and computer algebra on a net of approximately 250 workstations. It should be enhanced to work on more than 1000 machines all...

متن کامل

Supporting Fault-Tolerant Parallel Programming in Linda1

Linda is a language for programming parallel applications whose most notable feature is a distributed shared memory called tuple space. While suitable for a wide variety of programs, one shortcoming of the language as commonly defined and implemented is a lack of support for writing programs that can tolerate failures in the underlying computing platform. This paper describes FT-Linda, a versio...

متن کامل

Supporting Fault-Tolerant Parallel Programming in Linda

Linda is a language for programming parallel applications whose most notable feature is a distributed shared memory called tuple space. While suitable for a wide variety of programs, one shortcoming of the language as commonly defined and implemented is a lack of support for writing programs that can tolerate failures in the underlying computing platform. This paper describes FT-Linda, a versio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996